EEGRA: Energy Efficient Geographic Routing Algorithms for Wireless Sensor Network

[[abstract]]Energy efficiency is critical in wireless sensor networks (WSN) for system reliability and deployment cost. The power consumption of the communication in multi-hop WSN is primarily decided by three factors: routing distance, signal interference, and computation cost of routing. Several routing algorithms designed for energy efficiency or interference avoidance had been proposed. However, they are either too complex to be useful in practices or specialized for certain WSN architectures. In this paper, we propose two energy efficient geographic routing algorithms (EEGRA) for wireless sensor networks, which are based on existing geographic routing algorithms and take all three factors into account. The first algorithm combines the interference into the routing cost function, and uses it in the routing decision. The second algorithm transforms the problem into a constrained optimization problem, and solves it by searching the optimal discretized interference level. We integrate four geographic routing algorithms: GOAFR+, Face Routing, GPSR, and RandHT, to both EEGRA algorithms and compare them with three other routing methods in terms of power consumption and computation cost for the grid and irregular sensor topologies. The results of our experiments show both algorithms conserve sensor’s routing energy 30% ~ 50% comparing to general geographic routing algorithms. In addition, the time complexity of EEGRA algorithms is similar to the geographic greedy routing methods, which is much faster than the optimal SINR-based algorithm.[[conferencetype]]國際[[conferencedate]]20121213~20121215[[iscallforpapers]]Y[[conferencelocation]]San Marcos, Texas, US

EDZL Scheduling for Large-Scale Cyber Service on Real-Time Cloud

[[sponsorship]]IEEE Computer Society Technical Committee on Business Informatics Systems[[conferencetype]]國際[[conferencedate]]20111212~20111214[[booktype]]電子版[[iscallforpapers]]Y[[conferencelocation]]Irvine, US

The Charisma of Online Group-Buying: The Moderating Role of Social Motivation

Group buying can spread worldwide because the growth of the online shopping market has been considerable. In addition to deal popularity and discount rate, social motivation was included in this study. If a consumer cannot achieve an economic exchange benefit, a social exchange benefit might provide another function for the group member to stay in the community. This study adopted convenience sampling and an online questionnaire to conduct a survey. Among 240 questionnaires collected, 204 were valid. According to ANOVA analysis, the results demonstrated that social motivation has a positive influence on the relationship between the discount of a product and customers 'purchasing intention but not on the relationship between the popularity of a product and customers' purchasing intention. Therefore, we concluded that strengthening social networking can have a positive effect on customers' purchasing intention and thus encouraging the development of group purchasing retailers and related industries

Integrin-mediated membrane blebbing is dependent on the NHE1 and NCX1 activities.

Integrin-mediated signal transduction and membrane blebbing have been well studied to modulate cell adhesion, spreading and migration^1-6^. However, the relationship between membrane blebbing and integrin signaling has not been explored. Here we show that integrin-ligand interaction induces membrane blebbing and membrane permeability change. We found that sodium-proton exchanger 1 (NHE1) and sodium-calcium exchanger 1 (NCX1) are located in the membrane blebbing sites and inhibition of NHE1 disrupts membrane blebbing and decreases membrane permeability change. However, inhibition of NCX1 enhances cell blebbing to cause cell swelling which is correlated with an intracellular sodium accumulation induced by NHE17. These data suggest that sodium influx induced by NHE1 is a driving force for membrane blebbing growth, while sodium efflux induced by NCX1 in a reverse mode causes membrane blebbing retraction. Together, these data reveal a novel function of NHE1 and NCX1 in membrane permeability change and blebbing and provide the link for integrin signaling and membrane blebbing

How to Reduce Unexpected eMBMS Session Disconnection: Design and Performance Analysis

In 3GPP eMBMS, sometimes sessions will be disconnected unexpectedly due to the miss of session keys. Although rekeying can prevent old users from getting multicast data, it also causes authorized users to miss subsequent data if they miss the key update messages. Thus, re-authentication is needed to obtain lost keys from KMM. We point out this problem in our previous work 1. In this paper, we further propose a new KeySet algorithm, which can pre-issue a number of keys to users when they join eMBMS. The advantage is that a user can still decode multicast data even if it misses some key updates tentatively. However, the cost is that allowing some old users to freely enjoying multicast for some time. In this paper, we quantify the tradeoff and derive the optimal case

Multi-Slot Allocation Protocols for Massive IoT Devices with Small-Size Uploading Data

The emergence of Internet of Things applications introduces new challenges such as massive connectivity and small data transmission. In traditional data transmission protocols, an ID (i.e., IP address or MAC address) is usually included in a packet so that its receiver is able to know who sent the packet. However, this introduces the big head-small body problem for light payload. To address this problem, the Hint protocols have been proposed. The main idea is to 'encode' information in a tiny broadcast Hint message that allows devices to 'decode' their transmission slots. Thus, it can significantly reduce transmission and contention overheads. In this letter, we extend eHint to support multi-slot data transmissions. Several efficient protocols are proposed. Our simulation results validate that the protocols can significantly increase the number of successfully transmitted devices, channel utilization, and payload of transmitted devices compared with eHint

eHint: An Efficient Protocol for Uploading Small-Size IoT Data

IoT (Internet of Things) has attracted a lot of attention recently. IoT devices need to report their data or status to base stations at various frequencies. The IoT communications observed by a base station normally exhibit the following characteristics: (1) massively connected, (2) lightly loaded per packet, and (3) periodical or at least mostly predictable. The current design principals of communication networks, when applied to IoT scenarios, however, do not fit well to these requirements. When a large number of devices contend to send small packets, the signaling overhead is not cost-effective. To address this problem, our previous work [1] proposes the Hint protocol, which is slot-based and schedule- oriented for uploading IoT devices' data. In this work, we extend [1] to support data transmissions for multiple resource blocks. We assume that the uplink payloads from IoT devices are small, each taking very few slots (or resource blocks), but devices are massive. The main idea is to "encode" information in a tiny broadcast that allows each device to "decode" its transmission slots, thus significantly reducing transmission overheads and contention overheads. Our simulation results verify that the protocol can significantly increase channel utilization compared with traditional schemes

Design and Analysis of the Key Management Mechanism in Evolved Multimedia Broadcast/Multicast Service

3GPP introduced the key management mechanism (KMM) in evolved multimedia broadcast/multicast service (eMBMS) to provide forward security and backward security for multicast contents. In this paper, we point out that KMM may lead to frequent rekeying and re-authentication issues due to eMBMS's characteristics: 1) massive group members; 2) dynamic group topology; and 3) unexpected wireless disconnections. Such issues expose extra load for both user equipment (UE) terminals and mobile operators. It seems prolonging the rekeying interval is an intuitive solution to minimizing the impact of the issues. However, a long rekeying interval is not considered the best operational solution due to revenue loss of content providers. This paper quantifies the tradeoff between the load of the UEs and the operators as well as the revenue loss of the content providers. Moreover, we emphasize how essential this rekeying interval has impacts on the problems. Using our proposed tradeoff model, the operators can specify a suitable rekeying interval to best balance the interest between the above three parties. The tradeoff model is validated by extensive simulations and is demonstrated to be an effective approach for the tradeoff analysis and optimization on eMBMS